import java.util.Arrays;
import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            String[] s = sc.nextLine().trim().split(" ");
            int len = s.length;
            int[] nums = new int[len];
            for (int i = 0; i < len; i++) {
                nums[i] = Integer.parseInt(s[i]);
            }
            System.out.println(Arrays.toString(getOrder(nums)));
        }
    }
    /*这就是一个组合问题，每个点与之后的点比较，类似与高中学的取线段，使每个数字互相之间只比较一次*/
    public static int[] getOrder(int[] arr) {
        int len = arr.length;
        int[] res = new int[len];
        for (int i = 0; i < len; i++) {
            res[i] = 1;
        }
        for (int i = 0; i < len; i++) {
            for (int j = i + 1; j < len; j++) {
                if (arr[i] <= arr[j]) {
                    res[j]++;
                }else {
                    res[i]++;
                }
            }
        }
        return res;
    }
}

